Improving Privacy in Cryptographic Elections
نویسنده
چکیده
This report describes two simple extensions to the paper A Robust and Veri able Cryptographically Secure Election Scheme presented in the 1985 Symposium on the Foundations of Computer Science. The rst extension allows the \government" to be divided into an arbitrary number of \tellers". With this extension, trust in any one teller is su cient to assure privacy, even if the remaining tellers conspire in an attempt to breach privacy. The second extension allows a government to reveal (and convince voters of) the winner in an election without releasing the actual tally. Combining these two extensions in a uniform manner remains an open problem.
منابع مشابه
Accuracy in Privacy-Preserving Data Mining Using the Paradigm of Cryptographic Elections
Data mining technology raises concerns about the handling and use of sensitive information, especially in highly distributed environments where the participants in the system may by mutually mistrustful. In this paper we argue in favor of using some well-known cryptographic primitives, borrowed from the literature on large-scale Internet elections, in order to preserve accuracy in privacy-prese...
متن کاملMulti-Autority Secret-Ballot Elections with Linear Work
We present new cryptographic protocols for multi-authority secret ballot elections that guarantee privacy, robustness, and universal verifiability. Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damg̊ard and Schoenmakers, and the verifiable secret sharing scheme of Pedersen, reduce the work required by the voter or ...
متن کاملFully Auditable Electronic Secret-Ballot Elections
“What could be easier than counting a bunch of votes!” is a natural thought when one first thinks of the problem of electronic voting. It does not seem very hard either to build an Internet-based system which enables people to vote conveniently from their PCs, WAP phones, or other personal devices. The problem gets much more difficult, however, if one wants to address ballot secrecy in a seriou...
متن کاملDistributed, End-to-end Verifiable, and Privacy-Preserving Internet Voting Systems
E-voting systems are a powerful technology for improving democracy by reducing election cost, increasing voter participation, and even allowing voters to directly verify the entire election procedure. Unfortunately, prior internet voting systems have single points of failure, which may result in the compromise of availability, voter secrecy, or integrity of the election results. In this paper, ...
متن کاملUniversally Verifiable Efficient Re-encryption Mixnet
Implementing a transparent audit process when an election is conducted by electronic means is of paramount importance. Universally verifiable mixnets are focused on providing such a property by means of cryptographic proofs verifiable by any auditor. While some of these systems require high amount of computing resources that make them inefficient for real elections, others proposals reduce the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986